Reducing the retrieval time of hashing method by using predictorsNISHIHARA, S; IKEDA, K.Communications of the ACM. 1983, Vol 26, Num 12, pp 1082-1088, issn 0001-0782Article

Critères d'optimisation du temps consacré aux utilisateurs dans les systèmes d'information automatisés aux possibilités limitéesSIVKOV, V. N.Naučno-tehničeskaâ informaciâ - Vsesoûznyj institut naučnoj i tehničeskoj informacii. Seriâ 2. Informacionnye processy i sistemy. 1987, Num 8, pp 6-9, issn 0548-0027Article

The problem of time in phased array radarBILLAN, E. R.IEE conference publication. 1997, pp 563-567, issn 0537-9989, isbn 0-85296-698-9Conference Paper

OPTIMAL TREE LISTS FOR INFORMATION STORAGE AND RETRIEVAL.STANFEL LE.1976; INFORM. SYST.; G.B.; DA. 1976; VOL. 2; NO 2; PP. 65-70; BIBL. 8 REF.Article

Combining exclusive and continuous fingerprint classificationLIFENG SHA; XIAOOU TANG.International Conference on Image Processing. 2004, isbn 0-7803-8554-3, 5Vol, Vol2, 1245-1248Conference Paper

Identification of semantics : Balancing between complexity and validityFALELAKIS, Manolis; DIOU, Christos; DELOPOULOS, Anastasios et al.IEEE Workshop on Multimedia Signal Processing. 2004, pp 434-437, isbn 0-7803-8578-0, 1Vol, 4 p.Conference Paper

Variable speech search technique for digital VCRsKOBAYASHI, M; TAKEUCHI, A; HAMAMOTO, Y et al.SMPTE journal (1976). 1995, Vol 104, Num 7, pp 448-451, issn 0036-1682Conference Paper

On search times for early-insertion coalesced hashingPITTEL, B; JENN-HWA YU.SIAM journal on computing (Print). 1988, Vol 17, Num 3, pp 492-503, issn 0097-5397Article

Detection of repetitive patterns in action-sequences with noise in programming by demonstrationPENTEADO, Raqueline R. De M; DA SILVA, Sérgio R. P; FURUTA, Alexandre H et al.Lecture notes in computer science. 2006, pp 380-389, issn 0302-9743, isbn 3-540-45462-4, 1Vol, 10 p.Conference Paper

Fast fractal encoding algorithm using the law of cosinesWANG, Chou-Chen; LIN, Liang-Chi; TSAI, Shou-Hsuan et al.MWSCAS : Midwest symposium on circuits and systems. 2004, isbn 0-7803-8346-X, 3Vol, Vol I, 233-236Conference Paper

A constant update time finger search treeDIETZ, P. F; RAJEEV RAMAN.Information processing letters. 1994, Vol 52, Num 3, pp 147-154, issn 0020-0190Article

Máme čas na klasickou rešerši z tištěných rejstříků? = Avons nous encore le temps d'effectuer une recherche manuelle dans des index suprimés?HORKY, J; HUML, J.Československá informatika. 1986, Vol 28, Num 2, pp 40-45, issn 0322-8509Article

Cutting your online search billsBROWN, J; ELLENBOGEN, B.Online (Weston, CT). 1992, Vol 16, Num 6, pp 32-34, issn 0146-5422Article

Ein dynamisch zeit-optimierendes Abfragesystem für Textdateren auf der Grundlage der Logik-Programmierung = Un système d'accès à l'information dans les fichiers textuels basée sur la programmation logique = A system for accessing information in textual files based on logic programmingBERTSCH, E.Angewandte Informatik. 1985, Vol 27, Num 4, pp 137-144, issn 0013-5704Article

STOPPING RULES AND THEIR EFFECT ON EXPECTED SEARCH LENGTHKRAFT DN; LEE T.1979; INFORM. PROCESSG MANAG.; USA; DA. 1979; VOL. 15; NO 1; PP. 47-58; BIBL. 6 REF.Article

How age affects the speed of perception of computer iconsLINDBERG, Tomas; NÄSÄNEN, Risto; MÜLLER, Kiti et al.Displays. 2006, Vol 27, Num 4-5, pp 170-177, issn 0141-9382, 8 p.Article

Two-way chaining with reassignmentDALAL, Ketan; DEVROYE, Luc; MALALLA, Ebrahim et al.SIAM journal on computing (Print). 2006, Vol 35, Num 2, pp 327-340, issn 0097-5397, 14 p.Article

ONLINE ORDERING WITH DIALORDERPOPOVICH M; MILLER B.1981; ONLINE; USA; DA. 1981; VOL. 5; NO 2; PP. 63-65Article

BINARY SEARCH TREES: AVERAGE AND WORST CASE BEHAVIORGUETTLER R; MEMLHORN K; SCHNEIDER W et al.1980; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1980; VOL. 16; NO 1-3; PP. 41-61; ABS. GER/RUS; BIBL. 22 REF.Article

MACHINE ASSISTED REFERENCE SERVICE IN A PUBLIC LIBRARY: A ONE MONTH TEST PERIOD.RAEDEKE A.1978; ONLINE; USA; DA. 1978; VOL. 2; NO 4; PP. 56-59Article

MISE EN ORDRE OPTIMAL DES ZONES D'UN CRITERE DANS UN FICHIERSHVETSOV VI.1978; EKON. MAT. METODY; SUN; DA. 1978; VOL. 14; NO 5; PP. 968-974; BIBL. 4 REF.Article

AN ORGANIZATION OF MINIMUM SEARCHING DOMAIN FILEAKAMATSU A; KAJITANI K; TEZUKA Y et al.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 4; PP. 17-24; BIBL. 9 REF.Article

ZEITANANLYSEN, EFFEKTIVITAETS- UND BELASTUNGSUNTERSUCHUNGEN IN DER INFORMATIONS ABTEILUNG DES IDIS. = ANALYSE DES TEMPS, ETUDE DE L'EFFICACITE ET DES CHARGES DANS LE DEPARTEMENT INFORMATION DE L'IDISLANGE H; NACKE O.1977; NACHR. DOKUMENT.; DTSCH.; DA. 1977; VOL. 28; NO 2; PP. 58-63; ABS. ANGL.; BIBL. 15 REF.Article

TEMPO OF ON-LINE USER INTERACTION.PENNIMAN WD; PERRY JC.1976; IN: INF. INTERACTION. MID-YEAR MEET. 5; NASHVILLE, TENN.; 1976; WASHINGTON, D.C.; AM. SOC. INF. SCI.; DA. 1976; PP. 10-23; BIBL. 10 REF.Conference Paper

EFFICACITE COMPAREE DES SYSTEMES DE RECHERCHE DE L'INFORMATION DOCUMENTAIRE UTILISANT DES DONNEES D'ENTREE VARIEES TITRES, RESUMES DES MOTS CLES)ROZENMAN MI.1976; NAUCH.-TEKH. INFORM., 2; S.S.S.R.; DA. 1976; NO 7; PP. 24-30; ABS. ANGL. ALLEM.; BIBL. 33 REF.Article